On torsionfree classes which are not precover classes
نویسندگان
چکیده
منابع مشابه
FUZZY EQUATIONAL CLASSES ARE FUZZY VARIETIES
In the framework of fuzzy algebras with fuzzy equalities and acomplete lattice as a structure of membership values, we investigate fuzzyequational classes. They consist of special fuzzy algebras fullling the samefuzzy identities, dened with respect to fuzzy equalities. We introduce basicnotions and the corresponding operators of universal algebra: construction offuzzy subalgebras, homomorphisms...
متن کاملOn classes of convolutional codes that are not asymptotically catastrophic
Denote by w 0 the minimum average weight per edge over all nonzero cycles in the state diagram for a convolutional code, and assume that a technique is available for generating canonical parity-check matrices for codes with increasing degree m. The obtained class of codes is asymptotically catastrophic if w 0 approaches zero for large m. In this paper we prove the existence of convolutional cod...
متن کاملWhich Classes of Origin Graphs Are Generated by Transducers
We study various models of transducers equipped with origin information. We consider the semantics of these models as particular graphs, called origin graphs, and we characterise the families of such graphs recognised by streaming string transducers. 1998 ACM Subject Classification F.4.3 Formal Languages
متن کاملOn Homology Classes Not Representable by Products
We show that Preissmann’s theorem implies that no closed negatively curved manifold is dominated by a non-trivial product. We also show that a fiber bundle whose base and fiber are negatively curved is dominated by a product if and only if it has a finite covering space which is a trivial bundle.
متن کاملSome classes of graphs that are not PCGs
A graph G = (V, E) is a pairwise compatibility graph (PCG) if there exists an edge-weighted tree T and two non-negative real numbers dmin and dmax, dmin ≤ dmax, such that each node u ∈ V is uniquely associated to a leaf of T and there is an edge (u, v) ∈ E if and only if dmin ≤ dT (u, v) ≤ dmax, where dT (u, v) is the sum of the weights of the edges on the unique path PT (u, v) from u to v in T...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Czechoslovak Mathematical Journal
سال: 2008
ISSN: 0011-4642,1572-9141
DOI: 10.1007/s10587-008-0035-6